Cyber Swarm Algorithms for Multi-objective Nurse Rostering Problem
نویسندگان
چکیده
It is time-consuming to determine the nurse rostering using traditional human-involved manner in order to account for administrative operations, business benefits, governmental regulations, and nurse requests. Moreover, the objectives cannot be measured quantitatively even when the nurse rostering is generated after a lengthy manual process. This paper presents a multiobjective optimization method based on the cyber swarm algorithm (CSA), one of the most successful variations of particle swarm optimization, to solve the nurse rostering problem with multiple objectives and a set of hard constraints. The proposed method incorporates salient features from particle swarm optimization, adaptive memory programming, scatter search and path relinking to create advantages. The experimental results on two test datasets demonstrate that the proposed method outperforms several state-of-the-art multiobjective evolutionary algorithms in obtaining results with better convergence and diversity performances.
منابع مشابه
Solving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کاملNurse rostering using fuzzy logic: A case study
In this paper, we used the fuzzy set theory for modeling flexible constraints and uncertain data in nurse scheduling problems and proposed a fuzzy linear model for nurse rostering problems. The developed model can produce rosters that satisfy hospital objectives, ward requirements and staff preferences by satisfying their requests as much as possible. Fuzzy sets are used for modeling demands of...
متن کاملEMCSO: An Elitist Multi-Objective Cat Swarm Optimization
This paper introduces a novel multi-objective evolutionary algorithm based on cat swarm optimizationalgorithm (EMCSO) and its application to solve a multi-objective knapsack problem. The multi-objective optimizers try to find the closest solutions to true Pareto front (POF) where it will be achieved by finding the less-crowded non-dominated solutions. The proposed method applies cat swarm optim...
متن کاملA hybrid particle swarm optimization and an improved heuristic algorithm for an airline crew rostering problem
The airline crew scheduling problem is a combinatorial optimization problem and belongs to the class of NPhard problems. An effective method for solving the airline crew scheduling problem can reduce the crew costs and improve crew satisfaction. Because of its complexity, the problem is divided into two subproblems: the crew pairing problem and the crew rostering problem. In this paper, the cre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013